Chapter 9 Universal prediction and coding

نویسنده

  • John Duchi
چکیده

In this chapter, we explore sequential game playing and online probabilistic prediction schemes. These have applications in coding when the true distribution of the data is unknown, biological algorithms (encoding genomic data, for example), control, and a variety of other areas. The field of universal prediction is broad; in addition to this chapter touching briefly on a few of the techniques therein and their relationships with statistical modeling and inference procedures, relevant reading includes the survey by Merhav and Feder [9], the more recent book of Grünwald [5], and Tsachy Weissman’s EE376c course at Stanford.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chapter 10 Universal prediction with other losses

Thus far, in our discussion of universal prediction and related ideas, we have focused (essentially) exclusively on making predictions with the logarithmic loss, so that we play a full distribution over the set X as our prediction at each time step in the procedure. This is natural in settings, such as coding (recall examples 7.5 and 9.1), in which the log loss corresponds to a quantity we dire...

متن کامل

Universal prediction and universal coding

Although prediction schemes which are named \universal" are now abundant, very little has been addressed as to the de nition of universal prediction. This paper addresses for -nary ( 2) sequences the criteria of successful universal prediction and the prediction schemes which achieve the goals. We propose the following criteria: for any probability measures in a given measure class, the error p...

متن کامل

Twice Universal Linear Prediction of Individual Sequences

We present a linear prediction algorithm which is \twice universal," over parameters and model orders, for individual sequences under the square-error loss function. The sequentially accumulated mean-square prediction error is as good as any linear predictor of order up to some M. Following an approach taken in many prediction problems we transform the linear prediction problem into a sequentia...

متن کامل

A Fast Block Size Decision For Intra Coding in HEVC Standard

Intra coding in High efficiency video coding (HEVC) can significantly improve the compression efficiency using 35 intra-prediction modes for 2N×2N (N is an integer number ranging from six to two) luma blocks. To find the luma block with the minimum rate-distortion, it must perform 11932 different rate-distortion cost calculations. Although this approach improves coding efficiency compared to th...

متن کامل

A Fast Block Size Decision For Intra Coding in HEVC Standard

Intra coding in High efficiency video coding (HEVC) can significantly improve the compression efficiency using 35 intra-prediction modes for 2N×2N (N is an integer number ranging from six to two) luma blocks. To find the luma block with the minimum rate-distortion, it must perform 11932 different rate-distortion cost calculations. Although this approach improves coding efficiency compared to th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014